Dominating set

Results: 145



#Item
21An Approximation Algorithm for Bounded Degree Deletion∗ Tom´aˇs Ebenlendr† Petr Kolman‡

An Approximation Algorithm for Bounded Degree Deletion∗ Tom´aˇs Ebenlendr† Petr Kolman‡

Add to Reading List

Source URL: kam.mff.cuni.cz

Language: English - Date: 2009-06-04 05:35:50
22tria-free-after-review14.dvi

tria-free-after-review14.dvi

Add to Reading List

Source URL: community.dur.ac.uk

Language: English - Date: 2012-04-30 01:42:59
23Connected Dominating Set in Graphs Without Long Paths And Cycles Eglantine Camby1 and Oliver Schaudt2 1  D´epartement de Math´ematique, Universit´e Libre de Bruxelles, Boulevard du Triomphe, 1050

Connected Dominating Set in Graphs Without Long Paths And Cycles Eglantine Camby1 and Oliver Schaudt2 1 D´epartement de Math´ematique, Universit´e Libre de Bruxelles, Boulevard du Triomphe, 1050

Add to Reading List

Source URL: homepages.ulb.ac.be

Language: English - Date: 2015-10-11 06:53:34
    24Balls into bins via local search: cover time and maximum load Karl Bringmann1 , Thomas Sauerwald2 , Alexandre Stauffer3 , and He Sun1 1 2

    Balls into bins via local search: cover time and maximum load Karl Bringmann1 , Thomas Sauerwald2 , Alexandre Stauffer3 , and He Sun1 1 2

    Add to Reading List

    Source URL: people.mpi-inf.mpg.de

    Language: English - Date: 2016-01-03 06:46:50
    25Distributed Verification and Hardness of Distributed ∗ Approximation Atish Das Sarma  †

    Distributed Verification and Hardness of Distributed ∗ Approximation Atish Das Sarma †

    Add to Reading List

    Source URL: www.tik.ee.ethz.ch

    Language: English - Date: 2015-05-18 12:16:16
    26Maximizing Submodular Set Function with Connectivity Constraint: Theory and Application to Networks Tung-Wei Kuo† ‡ , Kate Ching-Ju Lin† , and Ming-Jer Tsai‡ †  Research Center for Information Technology Innova

    Maximizing Submodular Set Function with Connectivity Constraint: Theory and Application to Networks Tung-Wei Kuo† ‡ , Kate Ching-Ju Lin† , and Ming-Jer Tsai‡ † Research Center for Information Technology Innova

    Add to Reading List

    Source URL: nms.citi.sinica.edu.tw

    Language: English - Date: 2013-02-26 21:19:15
    27B. Balasundaram · S. Butenko · I. V. Hicks? · S. Sachdeva Clique Relaxations in Social Network Analysis: The Maximum k-plex Problem

    B. Balasundaram · S. Butenko · I. V. Hicks? · S. Sachdeva Clique Relaxations in Social Network Analysis: The Maximum k-plex Problem

    Add to Reading List

    Source URL: www.caam.rice.edu

    Language: English - Date: 2006-08-14 16:34:49
    28JMLR: Workshop and Conference Proceedings vol 40:1–13, 2015  Online Learning with Feedback Graphs: Beyond Bandits Noga Alon  NOGAA @ POST. TAU . AC . IL

    JMLR: Workshop and Conference Proceedings vol 40:1–13, 2015 Online Learning with Feedback Graphs: Beyond Bandits Noga Alon NOGAA @ POST. TAU . AC . IL

    Add to Reading List

    Source URL: jmlr.org

    Language: English - Date: 2015-07-20 20:08:35
    29Approximation algorithms for mixed, windy, and capacitated arc routing problems René van Bevern1 , Christian Komusiewicz2 , and Manuel Sorge2 1 2

    Approximation algorithms for mixed, windy, and capacitated arc routing problems René van Bevern1 , Christian Komusiewicz2 , and Manuel Sorge2 1 2

    Add to Reading List

    Source URL: fpt.akt.tu-berlin.de

    Language: English - Date: 2015-08-10 10:23:26
    30Statistical Algorithms and a Lower Bound for Detecting Planted Cliques Vitaly Feldman Almaden Research Center IBM San Jose, CA 95120

    Statistical Algorithms and a Lower Bound for Detecting Planted Cliques Vitaly Feldman Almaden Research Center IBM San Jose, CA 95120

    Add to Reading List

    Source URL: www.levreyzin.com

    Language: English - Date: 2013-03-20 23:48:10